Transforms of rectangular coordinates

Rectangular Transforms for Digital Convolution on the Research Signal Processor

The Rectangular Transform (RT) method for computing convolutions belongs to a family of Reduced Computational Complexity (RCC) algorithms. Convolution calculations by the RT method were programmed for the Research Signal Processor (RSP) and run on the RSP simulator, giving tabulations of numbers of RSP machine cycles. One of the original objectives was to see how well the original RSP architect...

an infinite planar array of rectangular microstrip patch antenna analysis

the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...

A 400-MHz Processor for the Conversion of Rectangular to Polar Coordinates in 0.25- m CMOS

This paper describes the architecture and IC implementation of a rectangular-to-polar coordinate converter for digital communication applications. The architecture core uses small lookup ROMs, fast multipliers, and a single angle-rotation stage. Area and latency are reduced in comparison with traditional methods. The processor, implemented in 0.25m five-metal CMOS, has 14-b in-phase and quadrat...

A Comparison of the Optimal Multiplier in Polar and Rectangular Coordinates by Joseph Euzebe Tate

Toeplitz transforms of Fibonacci sequences

We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.